Connected component labeling on a 2D grid using CUDA
نویسندگان
چکیده
منابع مشابه
Connected component labeling on a 2D grid using CUDA
Connected component labeling is an important but computationally expensive operation required in many fields of research. The goal in the present work is to label connected components on a 2D binary map. Two different iterative algorithms for doing this task are presented. The first algorithm (Row–Col Unify) is based upon the directional propagation labeling, whereas the second algorithm uses t...
متن کاملConnected Component Labeling in CUDA
Connected component labeling (CCL) is a task of detecting connected regions in input data, and it finds its applications in pattern recognition, computer vision, and image processing. We present a new algorithm for connected component labeling in 2-D images implemented in CUDA. We first provide a brief overview of the CCL problem together with existing CPU-oriented algorithms. The rest of the c...
متن کاملA Hybrid Approach to Parallel Connected Component Labeling Using CUDA
Connected component labeling (CCL) is a mandatory step in image segmentation where each object in an image is identified and uniquely labeled. Sequential CCL is a time-consuming operation and thus is often implemented within parallel processing framework to reduce execution time. Several parallel CCL methods have been proposed in the literature. Among them are NSZ label equivalence (NSZLE) meth...
متن کاملFast Parallel Connected Component Labeling Algorithms Using Cuda Based on 8-directional Label Selection
Connected component labeling (CCL) is a key step in image segmentation where foreground pixels are extracted and labeled. Sequential CCL is a computationally expensive operation and thus is often done within parallel processing framework to reduce execution time. Various parallel CCL methods have been proposed in the literature. Among them NSZ label equivalence (NSZ-LE) method seemed to perform...
متن کاملConnected Component Labeling Using Modified Linear Quadtrees
Using the modified linear quadtree proposed in [1,9], this paper presents an O(n·N) algorithm for labeling connected components of a region consisting of N BLACK nodes in a 2n by 2n binary image. As a direct application of the algorithm, a method for computing the perimeter of a region is also described.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2011
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2010.10.012